ON THE MINIMUM WEIGHT OF A 3-CONNECTED 1-PLANAR GRAPH
نویسندگان
چکیده
منابع مشابه
Minimum Weight 2-Edge-Connected Spanning Subgraphs in Planar Graphs
We present a linear time algorithm exactly solving the 2-edge connected spanning subgraph (2-ECSS) problem in a graph of bounded treewidth. Using this with Klein’s diameter reduction technique [15], we find a linear time PTAS for the problem in unweighted planar graphs, and the first PTAS for the problem in weighted planar graphs.
متن کاملDynamic Complexity of Planar 3-Connected Graph Isomorphism
Dynamic Complexity (as introduced by Patnaik and Immerman [13]) tries to express how hard it is to update the solution to a problem when the input is changed slightly. It considers the changes required to some stored data structure (possibly a massive database) as small quantities of data (or a tuple) are inserted or deleted from the database (or a structure over some vocabulary). The main diff...
متن کاملPlanar Minimum-Weight Triangulations
The classic problem of nding a minimum-weight triangulation for a given planar straight-line graph is considered in this paper. A brief overview of known methods is given in addition to some new results. A parallel greedy triangulation algorithm is presented along with experimental data that suggest a logarithmic relationship between the number of input vertices and its running time in the aver...
متن کامل3-connected Planar Graph Isomorphism is in Log-space
We consider the isomorphism and canonization problem for 3-connected planar graphs. The problem was known to be L -hard and in UL ∩ coUL [TW08]. In this paper, we give a deterministic log-space algorithm for 3-connected planar graph isomorphism and canonization. This gives an L -completeness result, thereby settling its complexity. The algorithm uses the notion of universal exploration sequence...
متن کاملThe Minimum Spanning Tree Problem on a Planar Graph
Finding a spanning tree of minimum weight is one of the best known graph problems. a liner time algorithm for the minimum spanning tree problem on a planar graph. In [1], Cheriton and Tarjan have proposed a linear time algorithm for this problem. The time complexity of our algorithm is the same as that of Cheriton and Tarjan's algorithm. Dierent from Cheriton and Tarjan's algorithm, our algorit...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Bulletin of the Korean Mathematical Society
سال: 2017
ISSN: 1015-8634
DOI: 10.4134/bkms.b160296